/**
 * Java：栈的最小值
 *
 * @author：紫水木鱼
 * @createDate：2024-12-25 15:28:41
 */
package leetcode.editor.cn;

//请设计一个栈，除了常规栈支持的pop与push函数以外，还支持min函数，该函数返回栈元素中的最小值。执行push、pop和min操作的时间复杂度必须为O(
//1)。 
// 示例： MinStack minStack = new MinStack(); minStack.push(-2); minStack.push(0); 
//minStack.push(-3); minStack.getMin();   --> 返回 -3. minStack.pop(); minStack.top(
//); --> 返回 0. minStack.getMin(); --> 返回 -2. 
//
// Related Topics 栈 设计 👍 102 👎 0

//栈的最小值
class MinStackLcci {
    public static void main(String[] args) {
        MinStack solution = new MinStackLcci().new MinStack();
        // TO TEST
    }

    //leetcode submit region begin(Prohibit modification and deletion)
    class MinStack {

        /**
         * initialize your data structure here.
         */
        public MinStack() {

        }

        public void push(int x) {

        }

        public void pop() {

        }

        public int top() {
            return 0;
        }

        public int getMin() {
            return 0;
        }
    }

/**
 * Your MinStack object will be instantiated and called as such:
 * MinStack obj = new MinStack();
 * obj.push(x);
 * obj.pop();
 * int param_3 = obj.top();
 * int param_4 = obj.getMin();
 */
//leetcode submit region end(Prohibit modification and deletion)

}